Efficient incremental hash chain with probabilistic filter-based method to update blockchain light nodes

In blockchain, ensuring integrity of data when updating distributed ledgers is a challenging and very fundamental process. Most blockchain networks use Merkle tree to verify the authenticity received from other peers on network. However, creating for each block in network composing branch every transaction verification request are time-consuming process requiring heavy computations. Moreover, sending these through generates lot traffic. Therefore, we proposed an updated mechanism that uses incremental hash chain with probabilistic filter data, provide proof efficiently update light nodes. this article, prove our model provides better performance less required computations than while maintaining same security level.